منابع مشابه
Keith Simmons
Computer scientists use formal verification to attempt to provide guarentees to the users of software about the run time characteristics of a given program. Verification techniques today often require a TCB or Trusted Code Base which due to time or effort constraints, the authors were not able to prove correct. When bugs occure in these pieces, they break down the strong guarentees of formal ve...
متن کاملBeck ,
We discuss and give elementary proofs of results of Brion and of LawrenceVarchenko on the lattice-point enumerator generating functions for polytopes and cones. While this note is purely expository, its contains a new proof of Brion’s Theorem using irrational decompositions.
متن کاملGlomerulonephritis Keith
Early diagnosis of glomerulonephritis (GN) in the adolescent is important in initiating appropriate treatment and controlling chronic glomerular injury that may eventually lead to end-stage renal disease (ESRD). The spectrum of GN in adolescents is more similar to that seen in young and middle-aged adults than to that observed in prepubertal children. In this article, the authors discuss the cl...
متن کاملClifford Wavelets and Clifford-valued MRAs
In this paper using the Clifford algebra over R4 and its matrix representation, we construct Clifford scaling functions and Clifford wavelets. Then we compute related mask functions and filters, which arise in many applications such as quantum mechanics.
متن کاملCounting Keith numbers
A Keith number is a positive integer N with the decimal representation a1a2 . . . an such that n ≥ 2 and N appears in the sequence (Km)m≥1 given by the recurrence K1 = a1, . . . ,Kn = an and Km = Km−1 + Km−2 + · · · + Km−n for m > n. We prove that there are only finitely many Keith numbers using only one decimal digit (i.e., a1 = a2 = · · · = an), and that the set of Keith numbers is of asympto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Today
سال: 1987
ISSN: 0031-9228,1945-0699
DOI: 10.1063/1.2819961